منابع مشابه
Directed Hypergraph Planarity
Directed hypergraphs are generalizations of digraphs and can be used to model binary relations among subsets of a given set. Planarity of hypergraphs was studied by Johnson and Pollak; in this paper we extend the planarity concept to directed hypergraphs. It is known that the planarity of a digraph relies on the planarity of its underlying graph. However, for directed hypergraphs, this property...
متن کاملHypergraph Drawing by Force-Directed Placement
We address the problem of drawing hypergraphs. We propose and evaluate a family of algorithms that transform a hypergraph drawing problem into a graph drawing problem. Each algorithm in the family relies on a different encoding of a hyperedge into a set of edges. The algorithms can then use any graph drawing algorithms. However, we here focus on the force-directed algorithms. We propose and dis...
متن کاملA Directed Hypergraph Model for RDF
1 Related Work An RDF document can be viewed as a graph: nodes are resources and arcs are properties. Formally [4], suppose there are three infinite sets: U (URIs), B = {bj : j ∈ N} (blank nodes), and L (literals). (s, p, o) ∈ (U∪B)×U×(U∪B∪L) is an RDF triple, s is called the subject, p the predicate, and o the object. An RDF graph T is a set of RDF triples. The universe of T , univ(T ), is the...
متن کاملDiffusion Operator and Spectral Analysis for Directed Hypergraph Laplacian
In spectral graph theory, the Cheeger’s inequality gives upper and lower bounds of edge expansion in normal graphs in terms of the second eigenvalue of the graph’s Laplacian operator. Recently this inequality has been extended to undirected hypergraphs and directed normal graphs via a non-linear operator associated with a diffusion process in the underlying graph. In this work, we develop a uni...
متن کاملA directed hypergraph model for random time dependent shortest paths
We consider routing problems in dynamic networks where arc travel times are both random and time dependent. The problem of nding the best route to a xed destination is formulated in terms of shortest hyperpaths on a suitable time-expanded directed hypergraph. The latter problem can be solved in linear time, with respect to the size of the hypergraph, for several deenitions of hyperpath length. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Advanced Research in Dynamical and Control Systems
سال: 2020
ISSN: 1943-023X
DOI: 10.5373/jardcs/v12sp4/20201622